Information-Theoretic Rule Induction
نویسندگان
چکیده
1 Background and motivation incremental learning (e.g., in decision tree design the entire tree algorithm must be re-run) while symbolic The problem of induction or "learning from exalgorithms often incorporate incremental learning as amples" can roughly be divided into two distinct cata basic mechanism. On the other hand, symbolic egories, namely the symbolic manipulation approach techniques cannot handle noise in the instance data
منابع مشابه
An Information-Theoretic Approach to the Pre-pruning of Classification Rules
The automatic induction of classification rules from examples is an important technique used in data mining. One of the problems encountered is the overfitting of rules to training data. In some cases this can lead to an excessively large number of rules, many of which have very little predictive value for unseen data. This paper is concerned with the reduction of overfitting. It introduces a t...
متن کاملProbabilistic approaches to rough sets
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize partitions of a universe. Both algebraic and probabilistic rough set approximations are studied. The probabilistic approximations are defined in a decision-theoretic framework. The problem of rule induction, a major appl...
متن کاملUsing J-Pruning to Reduce Overfitting of Classification Rules in Noisy Domains
The automatic induction of classification rules from examples is an important technique used in data mining. One of the problems encountered is the overfitting of rules to training data. This paper describes a means of reducing overfitting known as J-pruning, based on the J-measure, an information theoretic means of quantifying the information content of a rule, and examines its effectiveness i...
متن کاملProof-theoretic analysis by iterated reflection
Progressions of iterated reflection principles can be used as a tool for ordinal analysis of formal systems. Technically, in some sense, they replace the use of omega-rule. We compare the information obtained by this kind of analysis with the results obtained by the more usual proof-theoretic techniques. In some cases the techniques of iterated reflection principles allows to obtain sharper res...
متن کاملLearning Fuzzy Rule-Based Neural Networks for Function Approximation
In this paper, we present a method for the induction of fuzzy logic rules to predict a numerical function from samples of the function and its dependent variables. This method uses an information-theoretic approach based on our previous work with discrete-valued data [3]. The rules learned can then be used in a neural network to predict the function value based upon its dependent variables. An ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988